Topological and Arithmetical Properties of Infinitary Rational Relations
نویسنده
چکیده
We prove that there exist some infinitary rational relations which are analytic but non Borel sets, giving an answer to a question of Simonnet [Sim92]. Then we show that for every countable ordinal α one cannot decide whether a given infinitary rational relation is in the Borel class Σα ( respectively Π 0 α). Furthermore one cannot decide whether a given infinitary rational relation is a Borel set or a Σ1-complete set. We prove some recursive analogues to these properties. In particular one cannot decide whether an infinitary rational relation is an arithmetical set. We then deduce from the proof of these results some other ones, like: one cannot decide whether the complement of an infinitary rational relation is also an infinitary rational relation
منابع مشابه
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations
We prove that for every countable ordinal α one cannot decide whether a given infinitary rational relation is in the Borel class Σα (respectively Π 0 α). Furthermore one cannot decide whether a given infinitary rational relation is a Borel set or a Σ1-complete set. We prove some recursive analogues to these properties. In particular one cannot decide whether an infinitary rational relation is a...
متن کاملHighly Undecidable Problems For Infinite Computations
We show that many classical decision problems about 1counter ω-languages, context free ω-languages, or infinitary rational relations, are Π12-complete, hence located at the second level of the analytical hierarchy, and “highly undecidable”. In particular, the universality problem, the inclusion problem, the equivalence problem, the determinizability problem, the complementability problem, and t...
متن کاملOn the Topological Complexity of Infinitary Rational Relations
We prove in this paper that there exists some infinitary rational relations which are analytic but non Borel sets, giving an answer to a question of Simonnet [Sim92]. 1991 Mathematics Subject Classification. 68Q45; 03D05; 03D55; 03E15.
متن کاملWadge Degrees of Infinitary Rational Relations
We show that, from the topological point of view, 2-tape Büchi automata have the same accepting power as Turing machines equipped with a Büchi acceptance condition. The Borel and the Wadge hierarchies of the class RATω of infinitary rational relations accepted by 2-tape Büchi automata are equal to the Borel and the Wadge hierarchies of ω-languages accepted by realtime Büchi 1-counter automata o...
متن کاملThree Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular ω-Language
It was noticed by Harel in [Har86] that “one can define Σ 1 -complete versions of the well-known Post Correspondence Problem”. We first give a complete proof of this result, showing that the infinite Post Correspondence Problem in a regular ω-language is Σ 1 -complete, hence located beyond the arithmetical hierarchy and highly undecidable. We infer from this result that it is Π 1 -complete to d...
متن کامل